Audible Convergence for Optimal Base Melody Extension with Statistical Genre-Specific Interval Distance Evaluation
Identifieur interne : 001857 ( Main/Exploration ); précédent : 001856; suivant : 001858Audible Convergence for Optimal Base Melody Extension with Statistical Genre-Specific Interval Distance Evaluation
Auteurs : Ronald Hochreiter [Autriche]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2006.
Abstract
Abstract: In this paper, an evolutionary algorithm is used to calculate optimal extensions of a base melody line by statistical interval-distance minimization. Applying an evolutionary algorithm for solving such an optimization problem reveals the effect of audible convergence, when iterations of the optimization process, which represent sub-optimal melody lines, are combined to a musical piece. An example is provided to evaluate the algorithm, and to point out differences, when different musical genres, represented by different interval distance classification schemes, are applied.
Url:
DOI: 10.1007/11732242_68
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 004455
- to stream Istex, to step Curation: 003F81
- to stream Istex, to step Checkpoint: 001214
- to stream Main, to step Merge: 001878
- to stream Main, to step Curation: 001857
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Audible Convergence for Optimal Base Melody Extension with Statistical Genre-Specific Interval Distance Evaluation</title><author><name sortKey="Hochreiter, Ronald" sort="Hochreiter, Ronald" uniqKey="Hochreiter R" first="Ronald" last="Hochreiter">Ronald Hochreiter</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:DA78C933D3BAEF5A312FB60C49C1E2FCC50D4EA1</idno><date when="2006" year="2006">2006</date><idno type="doi">10.1007/11732242_68</idno><idno type="url">https://api.istex.fr/document/DA78C933D3BAEF5A312FB60C49C1E2FCC50D4EA1/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">004455</idno><idno type="wicri:Area/Istex/Curation">003F81</idno><idno type="wicri:Area/Istex/Checkpoint">001214</idno><idno type="wicri:doubleKey">0302-9743:2006:Hochreiter R:audible:convergence:for</idno><idno type="wicri:Area/Main/Merge">001878</idno><idno type="wicri:Area/Main/Curation">001857</idno><idno type="wicri:Area/Main/Exploration">001857</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Audible Convergence for Optimal Base Melody Extension with Statistical Genre-Specific Interval Distance Evaluation</title><author><name sortKey="Hochreiter, Ronald" sort="Hochreiter, Ronald" uniqKey="Hochreiter R" first="Ronald" last="Hochreiter">Ronald Hochreiter</name><affiliation wicri:level="3"><country xml:lang="fr">Autriche</country><wicri:regionArea>Department of Statistics and Decision Support Systems, University of Vienna, Universitätsstraße 5/9, 1010, Vienna</wicri:regionArea><placeName><settlement type="city">Vienne (Autriche)</settlement><region nuts="2" type="province">Vienne (Autriche)</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2006</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno></series><idno type="istex">DA78C933D3BAEF5A312FB60C49C1E2FCC50D4EA1</idno><idno type="DOI">10.1007/11732242_68</idno><idno type="ChapterID">Chap68</idno><idno type="ChapterID">68</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper, an evolutionary algorithm is used to calculate optimal extensions of a base melody line by statistical interval-distance minimization. Applying an evolutionary algorithm for solving such an optimization problem reveals the effect of audible convergence, when iterations of the optimization process, which represent sub-optimal melody lines, are combined to a musical piece. An example is provided to evaluate the algorithm, and to point out differences, when different musical genres, represented by different interval distance classification schemes, are applied.</div></front></TEI><affiliations><list><country><li>Autriche</li></country><region><li>Vienne (Autriche)</li></region><settlement><li>Vienne (Autriche)</li></settlement></list><tree><country name="Autriche"><region name="Vienne (Autriche)"><name sortKey="Hochreiter, Ronald" sort="Hochreiter, Ronald" uniqKey="Hochreiter R" first="Ronald" last="Hochreiter">Ronald Hochreiter</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001857 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001857 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:DA78C933D3BAEF5A312FB60C49C1E2FCC50D4EA1
|texte= Audible Convergence for Optimal Base Melody Extension with Statistical Genre-Specific Interval Distance Evaluation
}}
| This area was generated with Dilib version V0.6.20. |  |